Concurrent Statistical Zero-Knowledge Arguments for NP from One Way Functions
نویسندگان
چکیده
In this paper we show a general transformation from any honest verifier statistical zero-knowledge argument to a concurrent statistical zero-knowledge argument. Our transformation relies only on the existence of one-way functions. It is known that the existence of zeroknowledge systems for any non-trivial language implies one way functions. Hence our transformation unconditionally shows that concurrent statistical zero-knowledge arguments for a non-trivial language exist if and only if standalone secure statistical zero-knowledge arguments for that language exist. Further, applying our transformation to the recent statistical zero-knowledge argument system of Nguyen et al (STOC’06) yields the first concurrent statistical zero-knowledge argument system for all languages in NP from any one way function.
منابع مشابه
Concurrent Zero Knowledge with Logarithmic Round-Complexity
We show that every language in NP has a (black-box) concurrent zero-knowledge proof system using Õ(log n) rounds of interaction. The number of rounds in our protocol is optimal, in the sense that any language outside BPP requires at least Ω̃(log n) rounds of interaction in order to be proved in black-box concurrent zero-knowledge. The zeroknowledge property of our main protocol is proved under t...
متن کاملZero Knowledge and Soundness Are Symmetric
We give a complexity-theoretic characterization of the class of problems in NP having zeroknowledge argument systems. This characterization is symmetric in its treatment of the zero knowledge and the soundness conditions, and thus we deduce that the class of problems in NP ∩ coNP having zero-knowledge arguments is closed under complement. Furthermore, we show that a problem in NP has a statisti...
متن کاملStatistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
We give a construction of statistically hiding commitment schemes (those in which the hiding property holds against even computationally unbounded adversaries) under the minimal complexity assumption that one-way functions exist. Consequently, one-way functions suffice to give statistical zero-knowledge arguments for any NP statement (whereby even a computationally unbounded adversarial verifie...
متن کاملBlack-Box Constructions of Two-Party Protocols from One-Way Functions
We exhibit constructions of the following two-party cryptographic protocols given only black-box access to a one-way function: – constant-round zero-knowledge arguments (of knowledge) for any language in NP; – constant-round trapdoor commitment schemes; – constant-round parallel coin-tossing. Previous constructions either require stronger computational assumptions (e.g. collision-resistant hash...
متن کاملStatistical Zero-Knowledge Arguments for NP Using Approximable-Preimage-Size One-Way Functions
A statistical zero knowledge argument for NP is a cryptographic primitive that allows a polynomial-time prover to convince another polynomial-time verifier of the validity of an NP statement. It is guaranteed that even an infinitely powerful verifier does not learn any additional information but the validity of the claim. Naor et al. [NOVY98] showed how to implement such a protocol using any on...
متن کامل